#include<bits/stdc++.h>
using namespace std;
int a[100100];
int n;
priority_queue<int,vector<int>,greater<int> > q;
void init()
{

    cin>>n;
    for(int i = 0;i < n;i++) cin>>a[i];
    sort(a,a+n);
}

int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    init();
    for(int i = 0;i < n;i++)
    {
        if(q.size())
        {
            if(q.top() < a[i]) q.pop();
        }
        q.push(a[i]);
    }
    cout<<q.size();
    return 0;
}
